Rook Jumping Maze Design Considerations
نویسندگان
چکیده
We define the Rook Jumping Maze, provide historical perspective, and describe a generation method for such mazes. When applying stochastic local search algorithms to maze design, most creative effort concerns the definition of an objective function that rates maze quality. We define and discuss several maze features to consider in such a function definition. Finally, we share our preferred design choices, make design process observations, and note the applicability of these techniques to variations of the Rook Jumping Maze.
منابع مشابه
Vortex Maze Construction
The creation of engaging mazes requires both mathematical and aesthetic considerations. We present an algorithm for producing mazes that we feel are difficult to solve. This algorithm is based on constructing and connecting obfuscating maze devices called vortices. A vortex is a collection of passages that wind around each other in a spiral and converge on a central junction. We explore variati...
متن کاملGeneralized Rook Polynomials and Orthogonal Polynomials
We consider several generalizations of rook polynomials. In particular we develop analogs of the theory of rook polynomials that are related to general Laguerre and Charlier polynomials in the same way that ordinary rook polynomials are related to simple Laguerre polynomials.
متن کاملRepresentation theory of q-rook monoid algebras
We show that, over an arbitrary field, q-rook monoid algebras are iterated inflations of Iwahori-Hecke algebras, and, in particular, are cellular. Furthermore we give an algebra decomposition which shows a q-rook monoid algebra is Morita equivalent to a direct sum of Iwahori-Hecke algebras. We state some of the consequences for the representation theory of q-rook monoid algebras.
متن کاملA Block Decomposition Algorithm for Computing Rook Polynomials
Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. [13] In this paper, we give a new decomposition theorem, which yields a more efficient algorithm for computing the rook polynomial. We show that, in the worst case, this block decomposition ...
متن کاملp-Rook Numbers and Cycle Counting in Cp o Sn
Cycle-counting rook numbers were introduced by Chung and Graham [8]. Cycle-counting q-rook numbers were introduced by Ehrenborg, Haglund, and Readdy [10] and cycle-counting q-hit numbers were introduced by Haglund [14]. Briggs and Remmel [5] introduced the theory of p-rook and p-hit numbers which is a rook theory model where the rook numbers correspond to partial permutations in Cp oSn, the wre...
متن کامل